Black-Box Based Limited Query Membership Inference Attack

نویسندگان

چکیده

Conventional membership inference attacks usually require a large number of queries the target model when training shadow models, and this task becomes extremely difficult is limited. Aiming at problem insufficient data for models due to limited queries, we propose attack method based on generative adversarial networks (GAN). First, use augment samples obtained by small expand model; Secondly, improved CNN obtain that have higher degree fitting different structures; Finally, evaluate accuracy proposed algorithm XgBoost, Logistic, neural network using public datasets MNIST CIFAR10 in black-box setting, results show our has an average 62% 83%, respectively. It can be seen that, compared with existing research methods, better effects under condition significantly reducing which shows feasibility attacks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query-limited Black-box Attacks to Classifiers

We study black-box attacks on machine learning classifiers where each query to the model incurs some cost or risk of detection to the adversary. We focus explicitly on minimizing the number of queries as a major objective. Specifically, we consider the problem of attacking machine learning classifiers subject to a budget of feature modification cost while minimizing the number of queries, where...

متن کامل

Black Box Variational Inference

Variational inference has become a widely used method to approximate posteriors in complex latent variables models. However, deriving a variational inference algorithm generally requires significant model-specific analysis. These efforts can hinder and deter us from quickly developing and exploring a variety of models for a problem at hand. In this paper, we present a “black box” variational in...

متن کامل

Constructive membership in black-box groups

We present an algorithm to reduce the constructive membership problem for a black-box group G to three instances of the same problem for involution centralisers in G. If G is a simple group of Lie type in odd characteristic, then this reduction can be performed in (Monte Carlo) polynomial time.

متن کامل

Overdispersed Black-Box Variational Inference

We introduce overdispersed black-box variational inference, a method to reduce the variance of the Monte Carlo estimator of the gradient in black-box variational inference. Instead of taking samples from the variational distribution, we use importance sampling to take samples from an overdispersed distribution in the same exponential family as the variational approximation. Our approach is gene...

متن کامل

Perturbative Black Box Variational Inference

Black box variational inference (BBVI) with reparameterization gradients triggered the exploration of divergence measures other than the Kullback-Leibler (KL) divergence, such as alpha divergences. In this paper, we view BBVI with generalized divergences as a form of estimating the marginal likelihood via biased importance sampling. The choice of divergence determines a bias-variance trade-off ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3175824